A generalization of variable elimination for separable inverse problems beyond least squares

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variable projection for nonlinear least squares problems

The variable projection algorithm of Golub and Pereyra (1973) has proven to be quite valuable in the solution of nonlinear least squares problems in which a substantial number of the parameters are linear. Its advantages are efficiency and, more importantly, a better likelihood of finding a global minimizer rather than a local one. The purpose of our work is to provide a more robust implementat...

متن کامل

A Least Squares Functional for Solving Inverse Sturm-Liouville Problems

Abstract. We present a variational algorithm for solving the classical inverse Sturm-Liouville problem in one dimension when two spectra are given. All critical points of the least squares functional are at global minima, which justifies minimization by a (conjugate) gradient descent algorithm. Numerical examples show that the resulting algorithm works quite reliable without tuning for particul...

متن کامل

Approximate Generalized Inverse Preconditioning Methods for Least Squares Problems

iv erative methods to solve least squares problems more efficiently. We especially focused on one kind of preconditioners, in which preconditioners are the approximate generalized inverses of the coefficient matrices of the least squares problems. We proposed two different approaches for how to construct the approximate generalized inverses of the coefficient matrices: one is based on the Minim...

متن کامل

Regularized total least squares approach for nonconvolutional linear inverse problems

In this correspondence, a solution is developed for the regularized total least squares (RTLS) estimate in linear inverse problems where the linear operator is nonconvolutional. Our approach is based on a Rayleigh quotient (RQ) formulation of the TLS problem, and we accomplish regularization by modifying the RQ function to enforce a smooth solution. A conjugate gradient algorithm is used to min...

متن کامل

On the Least Squares Solution of Inverse Eigenvalue Problems

An inverse eigenvalue problem where a matrix is to be constructed from some or all of its eigenvalues may not have a real valued solution at all An approximate solution in the sense of least squares is sometimes desirable Two types of least squares problems are formulated and explored in this paper In spite of their di erent appearance the two problems are shown to be equivalent Thus one new nu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Inverse Problems

سال: 2013

ISSN: 0266-5611,1361-6420

DOI: 10.1088/0266-5611/29/4/045003